Representing Motion Vectors in an Encoded Bitstream

ABSTRACT

A format for use in encoding moving image data, comprising: a sequence of frames including plurality of the frames in which at least a region is encoded using motion estimation; a respective set of motion vector values representing motion vectors of the motion estimation for each respective one of these frames or each respective one of one or more regions within each of such frames; and at least one respective indicator associated with each of the respective frames or regions, indicating whether the respective motion vector values of the respective frame or region are encoded at a first resolution or a second resolution.

RELATED APPLICATIONS

This application claims priority to and is a continuation of U.S. patentapplication Ser. No. 14/530,625, filed Oct. 31, 2014, which claimspriority under 35 U.S.C. § 119(e) to U.S. Provisional Patent ApplicationNo. 61/925,108, filed Jan. 8, 2014, and claims priority under 35 U.S.C.§ 119(e) to U.S. Provisional Patent Application No. 61/934,506, filedJan. 31, 2014, the entire disclosures of which are incorporated byreference herein in their entirety.

BACKGROUND

In modern communication systems a video signal may be sent from oneterminal to another over a medium such as a wired and/or wirelessnetwork, often a packet-based network such as the Internet. For examplethe video may be part of a VoIP (voice over Internet Protocol) callconducted from a VoIP client application executed on a user terminalsuch as a desktop or laptop computer, tablet or smart phone.

Typically the frames of the video are encoded by an encoder at thetransmitting terminal in order to compress them for transmission overthe network. The encoding for a given frame may comprise intra frameencoding whereby blocks are encoded relative to other blocks in the sameframe. In this case a target block is encoded in terms of a difference(the residual) between that block and a neighbouring block.Alternatively the encoding for some frames may comprise inter frameencoding whereby blocks in the target frame are encoded relative tocorresponding portions in a preceding frame, typically based on motionprediction. In this case a target block is encoded in terms of a motionvector identifying an offset between the block and the correspondingportion from which it is to be predicted, and a difference (theresidual) between the block and the corresponding portion from which itis predicted. A corresponding decoder at the receiver decodes the framesof the received video signal based on the appropriate type ofprediction, in order to decompress them for output to a screen at thedecoder side.

When encoding (compressing) a video, the motion vectors are used togenerate the inter frame prediction for the current frame. The encoderfirst searches for a similar block (the reference block) in a previousencoded frame that best matches the current block (target block), andsignals the displacement between the reference block and target block tothe decoder as part of the encoded bitstream. The displacement istypically represented as horizontal and vertical x and y coordinates,and is referred to as the motion vector.

The reference “block” is not in fact constrained to being at an actualblock position in the reference frame, i.e. is not restricted to thesame grid as the target blocks, but rather it is a correspondingly-sizedportion of the reference frame offset relative to the target block'sposition by the motion vector. According to present standards the motionvectors are represented at fractional pixel resolution. For instance inthe H.264 standard each motion vector is represented at ¼ pixelresolution. So by way of example, if a 16×16 block in the current frameis to be predicted from another 16×16 block in the previous frame thatis at 1 pixel left of the position of the target block, then the motionvector is (4,0). Or if the target block is to be predicted from areference block that is only, say, ¾ of a pixel to the left of thetarget block, the motion vector is (3,0). The reference block at afractional pixel position does not actually exist per se, but rather itis generated by interpolation between pixels of the reference frame. Thesub-pixel motion vectors can achieve significant performance in terms ofcompression efficiency.

SUMMARY

However, using a fractional pixel resolution incurs more bits to encodethe motion vector than if motion was estimated at integer pixelresolution, and it also incurs more processing resources in searchingfor the best matching reference. For video coding this may beworthwhile, e.g. as the reduced size of a better-matched residual maygenerally outweigh the bits incurred encoding the motion vector, or thequality achieved may be considered to justify the resources. However,not all moving images to be encoded are videos (i.e. captured from acamera). It is recognized herein that when encoding (compressing) amoving image that is captured from a screen rather than a camera, mostof the motion vectors in the encoded bit stream will generally point tointeger pixels, while very few of them tend to be found at fractionalpixel positions. Thus while encoders normally represent motion vectorsin bit streams in units of ¼ pixels, for screen sharing or recordingapplications bandwidth can in fact be saved without undue loss ofquality by encoding the motion vectors in units of only 1 pixel.

Nonetheless, considering that the fractional motion vector can still beuseful for normal video (captured by camera) or perhaps other movingimages (e.g. animations), the motion vector may be signaled in aflexible way: when the video source is from a captured screen the motionvector may be signaled in units of 1 pixel, but for normal video and/orother moving images a fractional pixel unit may still be used.

More generally, there may be various circumstances in which it may beuseful to have control over whether fractional or integer pixel motionvector resolution is used, e.g. depending on how the designer of theencoder wishes to implement any desired trade off or effect. E.g.perhaps some video or animations due to some aspect of their nature willbe more efficiently served by integer pixel resolution in the motionestimation, while other videos or other types of moving image may bemore efficiently served by fractional pixel resolution.

Hence according to one aspect disclosed herein, there is provided formatfor use in encoding moving image data, whereby moving image data encodedaccording to said format comprises:

-   -   a sequence of frames including plurality of said frames in which        at least a region is encoded using motion estimation;    -   a respective set of motion vector values representing motion        vectors of the motion estimation for each respective one of said        frames, or each respective one of one or more regions within        each of said frames; and    -   at least one respective indicator associated with each of said        respective frames or regions, indicating whether the respective        motion vector values of the respective frame or region are        encoded at a first resolution or a second resolution.

The motion vector values are encoded according to a protocol wherebymotion vector values encoded at the first resolution are represented ona scale having a larger number of finer steps, and motion vector valuesencoded at the second resolution are represented on a scale having asmaller number of coarser steps and thereby incur fewer bits on averagein the encoded bitstream. The coarser steps represent integer pixelunits and the finer steps represent fractional pixel units.

According to a further aspect disclosed herein, there is provided anetwork element or computer-readable storage medium carrying bitstreamof moving image data encoded according to such a format or protocol.

In embodiments, there may be provided a bitstream comprising some ofsaid plurality of frames or regions encoded at the first resolution andothers of said plurality of frames or regions encoded at the secondresolution, the respective indicator indicating the resolutionindividually for each of said plurality of (inter frame encoded) framesor regions.

In embodiments each of the motion vector values of each frame or regionmay be included in a motion vector field of the encoded bitstream, andaccording to said protocol the motion vector field may have a reducedsize for frames or regions whose motion vectors are encoded at thesecond resolution.

According to another aspect disclosed herein, there is provided adecoder comprising an input for receiving moving image data in encodedform, and a motion prediction module. The moving image data includes aplurality of frames in which at least a region is encoded using motionestimation (i.e. inter frame encoded frames), based on a format orprotocol in accordance with any of the embodiments disclosed herein. Themotion prediction module decodes said (inter frame encoded) frames orregions based on the motion vector values. This includes reading each ofthe indicators to determine whether the motion vector values of therespective frame or region are encoded at the first or secondresolution, and if the first resolution to interpret the motion vectorvalues in units of fractional pixels, and if the second resolution tointerpret the motion vector values in units of integer pixels.

In embodiments, the moving image data may comprise a respective twoindicators associated with each of said frames or regions, the twoindicators indicating the resolution of respective motion vectors in twodimensions, and the motion prediction module may be configured to readboth indicators and interpret the respective motion vector valuesaccordingly.

In embodiments each of at least some of said frames may be divided intomultiple regions; the moving image data may comprise at least onerespective indicator associated with each respective one of the multipleregions to individually indicate whether the motion vector values of therespective region are encoded at the first or second resolution; and themotion prediction module may be configured to read the indicators todetermine whether the motion vector values of each respective region areencoded at the first or second resolution, and to interpret therespective motion vector values in said units of fractional pixels orinteger pixels accordingly. In embodiment said regions may be slices ofan H.26x standard.

In embodiments, the moving image data may further comprises a setting toset whether the resolution of the motion vector values is beingindicated per region or per frame, and the motion prediction module maybe configured to read the setting and interpret the motion vector valuesaccordingly.

In further embodiments, the motion prediction module may be configuredto interpret the respective motion vector values in units of fractionalpixels as a default if the respective indicator is not present for oneof said frames or regions.

In yet further embodiments, the moving image data including the motionvectors may be further encoded according to a lossless encodingtechnique. The decoder may comprise an inverse of a lossless encodingstage preceding said decoding by the motion prediction module.

According to a further aspect, there is provided a computer programproduct embodied on a computer-readable storage medium and configured soas when executed to perform operations of the decoder according to anyof the embodiments disclosed herein.

This Summary is provided to introduce a selection of concepts in asimplified form that are further described below in the DetailedDescription. This Summary is not intended to identify key features oressential features of the claimed subject matter, nor is it intended tobe used to limit the scope of the claimed subject matter. Nor is theclaimed subject matter limited to implementations that solve any or allof the disadvantages noted herein.

BRIEF DESCRIPTION OF THE DRAWINGS

To aid understanding of the present disclosure and to show howembodiments may be put into effect, reference is made by way of exampleto the accompanying drawings in which:

FIG. 1 is a schematic representation of a video stream,

FIG. 2 is a schematic block diagram of a communication system,

FIG. 3 is a schematic representation of an encoded video stream,

FIG. 4 is a schematic block diagram of an encoder,

FIG. 5 is a schematic block diagram of a decoder,

FIG. 6 is a schematic representation of inter frame encoding scheme, and

FIG. 7 is a schematic representation of another inter frame encodingscheme.

DETAILED DESCRIPTION

FIG. 1 gives a schematic illustration of an input video signal capturedfrom a camera, and divided into spatial divisions to be encoded by avideo encoder so as to generate an encoded bitstream. The signalcomprises a moving video image divided in time into a plurality offrames (F), each frame representing the image at a different respectivemoment in time ( . . . t−1, t, t+1 . . . ). Within each frame, the frameis divided in space into a plurality of divisions each representing aplurality of pixels. These divisions may be referred to as blocks. Incertain schemes, the frame is divided and sub-divided into differentlevels of block. For example each frame may be divided into macroblocks(MB) and each macroblock may be divided into blocks (b), e.g. each blockrepresenting a region of 8×8 pixels within a frame and each macroblockrepresenting a region of 2×2 blocks (16×16 pixels). In certain schemeseach frame can also be divided into independently decodable slices (S),each comprising a plurality of macroblocks. The slices S can generallytake any shape, e.g. each slice being one or more rows of macroblocks oran irregular or arbitrarily defined selection of macroblocks (e.g.corresponding to a region of interest, ROI, in the image).

With regard to the term “pixel”, in the following the term is used torefer to samples and sampling positions in the sampling grid for thepicture array (sometimes in the literature the term “pixel” is insteadused to refer to all three colour components corresponding to one singlespatial position, and sometimes it is used to refer to a single positionor a single integer sample value in a single array). The resolution ofthe sampling grid is often different between the luma and chromasampling arrays. In embodiments the following may be applied to a 4:4:4representation, but it may potentially also be applied in 4:2:2 and4:2:0 for example.

Note also that while any given standard may give specific meanings tothe terms block or macroblock, the term block is also often used moregenerally in the art to refer to a division of the frame at a level onwhich encoding and decoding operations like intra or inter predictionare performed, and it is this more general meaning that will be usedherein unless specifically stated otherwise. For example the blocksreferred to herein may in fact be the divisions called blocks ormacroblocks in the H.26x standards, and the various encoding anddecoding stages may operate at a level of any such divisions asappropriate to the encoding mode, application and/or standard inquestion.

A block in the input signal as captured is usually represented in thespatial domain, where each colour-space channel is represented as afunction of spatial position within the block. For example in YUV colourspace each of the luminance (Y) and chrominance (U,V) channels may berepresented as a function of Cartesian coordinates x and y, Y(x,y),U(x,y) and V(x,y); or in RGB colour space each of the red (R), green (G)and blue (B) channels may be represented as a function of Cartesiancoordinates R(x,y), G(x,y), B(x,y). In this representation, each blockor portion is represented by a set of pixel values at different spatialcoordinates, e.g. x and y coordinates, so that each channel of thecolour space is represented in terms of a respective magnitude of thatchannel at each of a discrete set of pixel locations.

Prior to quantization however, the block may be transformed into atransform domain representation as part of the encoding process,typically a spatial frequency domain representation (sometimes justreferred to as the frequency domain). In the frequency domain eachcolour-space channel in the block is represented as a function ofspatial frequency (dimensions of 1/length) in each of two dimensions.For example this could be denoted by wavenumbers k_(x) and k_(y) in thehorizontal and vertical directions respectively, so that the channelsmay be expressed as Y(k_(x), k_(y)), U(k_(x), k_(y)) and V(k_(x), k_(y))in YUV space; or R(k_(x), k_(y)), G(k_(x),k_(y)), B(k_(x),k_(y)) in RGBspace. Thus instead of representing a colour-space channel in terms of amagnitude at each of a discrete set of pixel positions, the transformrepresents each colour-space channel in terms of a coefficientassociated with each of a discrete set of spatial frequency componentswhich make up the block, i.e. an amplitude of each of a discrete set ofspatial frequency terms corresponding to different frequencies ofspatial variation across the block. Possibilities for such transformsinclude a Fourier transform, Discrete Cosine Transform (DCT),Karhunen-Loeve Transform (KLT), or others.

The block diagram of FIG. 2 gives an example of a communication systemin which the techniques of this disclosure may be employed. Thecommunication system comprises a first, transmitting terminal 12 and asecond, receiving terminal 22. For example, each terminal 12, 22 maycomprise one of a mobile phone or smart phone, tablet, laptop computer,desktop computer, or other household appliance such as a television set,set-top box, stereo system, etc. The first and second terminals 12, 22are each operatively coupled to a communication network 32 and thefirst, transmitting terminal 12 is thereby arranged to transmit signalswhich will be received by the second, receiving terminal 22. Of coursethe transmitting terminal 12 may also be capable of receiving signalsfrom the receiving terminal 22 and vice versa, but for the purpose ofdiscussion the transmission is described herein from the perspective ofthe first terminal 12 and the reception is described from theperspective of the second terminal 22. The communication network 32 maycomprise for example a packet-based network such as a wide area internetand/or local area network, and/or a mobile cellular network.

The first terminal 12 comprises a computer-readable storage medium 14such as a flash memory or other electronic memory, a magnetic storagedevice, and/or an optical storage device. The first terminal 12 alsocomprises a processing apparatus 16 in the form of a processor or CPUhaving one or more execution units, a transceiver such as a wired orwireless modem having a transmitter 18, a video camera 15 and a screen17 (i.e. a display or monitor). Each of the camera 15 and screen 17 mayor may not be housed within the same casing as the rest of the terminal12 (and even the transmitter 18 could be internal or external, e.g.comprising a dongle or wireless router in the latter case). The storagemedium 14, video camera 15, screen 17 and transmitter 18 are eachoperatively coupled to the processing apparatus 16, and the transmitter18 is operatively coupled to the network 32 via a wired or wirelesslink. Similarly, the second terminal 22 comprises a computer-readablestorage medium 24 such as an electronic, magnetic, and/or an opticalstorage device; and a processing apparatus 26 in the form of a CPUhaving one or more execution units. The second terminal comprises atransceiver such as a wired or wireless modem having at least a receiver28 and a screen 25 which may or may not be housed within the same casingas the rest of the terminal 22. The storage medium 24, screen 25 andreceiver 28 of the second terminal are each operatively coupled to therespective processing apparatus 26, and the receiver 28 is operativelycoupled to the network 32 via a wired or wireless link.

The storage 14 on the first terminal 12 stores at least an encoder forencoding moving image data, the encoder being arranged to be executed onthe respective processing apparatus 16. When executed the encoderreceives a “raw” (unencoded) input video stream from the video camera15, it is operable to encode the video stream so as to compress it intoa lower bitrate stream, and outputs the encoded video stream fortransmission via the transmitter 18 and communication network 32 to thereceiver 28 of the second terminal 22. The storage 24 on the secondterminal 22 stores at least a video decoder arranged to be executed onits own processing apparatus 26. When executed the decoder receives theencoded video stream from the receiver 28 and decodes it for output tothe screen 25.

The encoder and decoder are also operable to encode and decode othertypes of moving image data, including screen sharing streams. A screensharing stream is image data captured from a screen 17 at the encoderside so that one or more other, remote users can see what the user atthe encoder side is seeing on screen, or so the user of that screen canrecord what's happening on screen for playback to one or more otherusers later. In the case of a call conducted between a transmittingterminal 12 and receiving terminal 22, the moving content of the screen17 at the transmitting terminal 12 will be encoded and transmitted live(in real-time) to be decoded and displayed on the screen 25 of thereceiving terminal 22. For example the encoder-side user may wish toshare with another user how he or she is working the desktop of his orher operating system, or some application.

Note that where it is said that a screen sharing stream is captured froma screen, or the like, this does not limit to any particular mechanismfor doing so. E.g. the data could be read from a screen buffer of thescreen 17, or captured by receiving an instance of the same graphicaldata that is being output from the operating system or from anapplication for display on the screen 17.

FIG. 3 gives a schematic representation of an encoded bitstream 33 aswould be transmitted from the encoder running on the transmittingterminal 12 to the decoder running on the receiving terminal 22. Thebitstream 33 comprises encoded image data 34 for each frame or slicecomprising the encoded samples for the blocks of that frame or slicealong with any associated motion vectors In one application, thebitstream may be transmitted as part of a live (real-time) call such asa VoIP call between the transmitting and receiving terminals 12, 22(VoIP calls can also include video and screen sharing). The bitstream 33also comprises header information 36 associated with each fame or slice.In embodiments the header 36 is arranged to include at least oneadditional element in the form of at least one flag 37 indicating theresolution of the motion vector, which will be discussed in more detailbelow.

FIG. 4 is a block diagram illustrating an encoder such as might beimplemented on transmitting terminal 12. The encoder comprises a mainencoding module 40 comprising: a discrete cosine transform (DCT) module51, a quantizer 53, an inverse transform module 61, an inverse quantizer63, an intra prediction module 41, an inter prediction module 43, aswitch 47, a subtraction stage (-) 49, and a lossless decoding stage 65.The encoder further comprises a control module 50 coupled to the interprediction module 43. Each of these modules or stages may be implementedas a portion of code stored on the transmitting terminal's storagemedium 14 and arranged for execution on its processing apparatus 16,though the possibility of some or all of these being wholly or partiallyimplemented in dedicated hardware circuitry is not excluded.

The subtraction stage 49 is arranged to receive an instance of the inputsignal comprising a plurality of blocks over a plurality of frames (F).The input stream is received from a camera 15 or captured from what isbeing displayed on the screen 17. The intra or inter prediction 41, 43generates a predicted version of a current (target) block to be encodedbased on a prediction from another, already-encoded block orcorrespondingly-sized reference portion. The predicted version issupplied to an input of the subtraction stage 49, where it is subtractedfrom the input signal (i.e. the actual signal) in the spatial domain toproduce a residual signal representing a difference between thepredicted version of the block and the corresponding block in the actualinput signal.

In intra prediction mode, the intra prediction 41 module generates apredicted version of the current (target) block to be encoded based on aprediction from another, already-encoded block in the same frame,typically a neighbouring block. When performing intra frame encoding,the idea is to only encode and transmit a measure of how a portion ofimage data within a frame differs from another portion within that sameframe. That portion can then be predicted at the decoder (given someabsolute data to begin with), and so it is only necessary to transmitthe difference between the prediction and the actual data rather thanthe actual data itself. The difference signal is typically smaller inmagnitude, so takes fewer bits to encode (due to the operation of thelossless compression stage 65—see below).

In inter prediction mode, the inter prediction module 43 generates apredicted version of the current (target) block to be encoded based on aprediction from another, already-encoded reference portion in adifferent frame than the current block, the reference portion having thesize of a block but being offset relative to the target block in thespatial domain by a motion vector that is predicted by the interprediction module 43 (inter prediction may also be referred to as motionprediction or motion estimation). The inter-prediction module 43 selectsthe optimal reference for a given target block by searching, in thespatial domain, through a plurality of candidate reference portionsoffset by a plurality of respective possible motion vectors in one ormore frames other than the target frame, and selecting the candidatethat minimizes the residual with respect to the target block accordingto a suitable metric. The inter prediction module 43 is switched intothe feedback path by switch 47, in place of the intra frame predictionstage 41, and so a feedback loop is thus created between blocks of oneframe and another in order to encode the inter frame relative to thoseof the other frame. I.e. the residual now represents the differencebetween the inter predicted block and the actual input block. Thistypically takes even fewer bits to encode than intra frame encoding.

The samples of the residual signal (comprising the residual blocks afterthe predictions are subtracted from the input signal) are output fromthe subtraction stage 49 through the transform (DCT) module 51 (or othersuitable transformation) where their residual values are converted intothe frequency domain, then to the quantizer 53 where the transformedvalues are converted to substantially discrete quantization indices. Thequantized, transformed indices of the residual as generated by thetransform and quantization modules 51, 53, as well as an indication ofthe prediction used in the prediction modules 41,43 and any motionvectors generated by the inter prediction module 43, are all output forinclusion in the encoded video stream 33 (see element 34 in FIG. 3); viaa further, lossless encoding stage 65 such as a Golomb encoder orentropy encoder where the motion vectors and transformed, quantizedindices are further compressed using lossless encoding techniques knownin the art.

An instance of the quantized, transformed signal is also fed back thoughthe inverse quantizer 63 and inverse transform module 61 to generate apredicted version of the block (as would be seen at the decoder) for useby the selected prediction module 41 or 43 in predicting a subsequentblock to be encoded, in the same way the current target block beingencoded was predicted based on an inverse quantized and inversetransformed version of a previously encoded block. The switch 47 isarranged to pass the output of the inverse quantizer 63 to the input ofeither the intra prediction module 41 or inter prediction module 43 asappropriate to the encoding used for the frame or block currently beingencoded.

FIG. 5 is a block diagram illustrating a decoder such as might beimplemented on the receiving terminal 22. The decoder comprises aninverse of the lossless encoding 95, an inverse quantization stage 83,an inverse DCT transform stage 81, a switch 70, and an intra predictionstage 71 and a motion compensation stage 73. Each of these modules orstages may be implemented as a portion of code stored on the receivingterminal's storage medium 24 and arranged for execution on itsprocessing apparatus 26, though the possibility of some or all of thesebeing wholly or partially implemented in dedicated hardware circuitry isnot excluded.

The inverse quantizer 81 is arranged to receive the encoded signal 33from the encoder, via the receiver 28 and inverse lossless coding stage95. The inverse quantizer 81 converts the quantization indices in theencoded signal into de-quantized samples of the residual signal(comprising the residual blocks) and passes the de-quantized samples tothe reverse DCT module 81 where they are transformed back from thefrequency domain to the spatial domain. The switch 70 then passes thede-quantized, spatial domain residual samples to the intra or interprediction module 71 or 73 as appropriate to the prediction mode usedfor the current frame or block being decoded, and the intra or interprediction module 71, 73 uses intra or inter prediction respectively todecode the blocks. Which mode to use is determined using the indicationof the prediction and/or any motion vectors received with the encodedsamples 34 in the encoded bitstream 33. Following on from this stage,the decoded blocks are output to be played out through the screen 25 atthe receiving terminal 22.

As mentioned, codecs according to conventional standards perform motionprediction at a resolution of quarter pixels, meaning the motion vectorsare also expressed in terms of quarter pixel steps. An example ofquarter pixel resolution motion estimation is shown in FIG. 6. In thisexample, pixel p in the upper left corner of the target block ispredicted from an interpolation between the pixels a, b, c and d, andthe other pixels of the target block will also be predicted based on asimilar interpolation between respective groups of pixels in thereference frame, according to the offset between the target block in oneframe and the reference portion in the other frame (these blocks beingshown with bold dotted lines in FIG. 6). However, performing motionestimation with this granularity has consequences, as discussed below.

Referring to the lossless coder 65 and decoder 95, lossless coding is aform of compression which works not by throwing away information (likequantization), but by using different lengths of codeword to representdifferent values depending on how likely those values are to occur, orhow frequently they occur, in the data to be encoded by the losslessencoding stage 65. For example the number of leading Os in the codewordbefore encountering a 1 may indicate the length of the codeword, so 1 isthe shortest codeword, then 010 and 011 are the next shortest, then00100 . . . , and so forth. Thus the shortest codewords are much shorterthan would be required if a uniform codeword length was used, but thelongest are longer than that. But by allocating the most frequent orlikely values to the shortest codewords and only the least likely orfrequently occurring values to the longer codewords, the resultingbitstream 33 can on average incur fewer bits per encoded value than if auniform codeword length was used, and thus achieve compression withoutdiscarding any further information.

Much of the encoder 40 prior to the lossless encoding stage 65 isdesigned to try to make as many of the values as small as possiblebefore being passed through the lossless coding stage 65. As they thenoccur more often, smaller values will then incur lower bitrate in theencoded bitstream 33 than larger values. This is why the residual isencoded as opposed to absolute samples. It is also the rationale behindthe transform 51, as many samples tend to transform to zero or smallcoefficients in the transform domain.

A similar consideration can be applied to the encoding of the motionvectors.

For instance, in H.264/MPEG-4 Part 10 and H.265/HEVC the motion vectoris encoded with Exponential Golomb Coding. The following table shows themotion vector values and the encoded bits.

Value Codeword Number of Bits Incurred 0 1 1 1 010 3 2 011 3 3 00100 5 400111 5 5 0001000 7 . . .

From the table above it can be seen that the larger the value is, themore bits are used. This means the higher the resolution of the motionvector, the more bits are incurred. E.g. so with a quarter pixelresolution, an offset of 1 pixel has to be represented by a value of 4,incurring 5 bits in the encoded bitstream.

In encoding video (captured from a camera) the cost of this resolutionin the motion vector may be worthwhile, as the finer resolution mayprovide more opportunities in the search for a lower cost residualreference. However, it is observed herein that for moving imagescaptured from a screen, most of the spatial displacements tend to be atfull pixel displacements and few of them tend to be at fractional pixelpositions, so most of the motion vectors tend to point to integer pixelvalues and very few tend to point to fractional pixel values.

On such a basis, it may be desirable to encode the motion vectors forimage data captured from a screen with a resolution of 1 pixel.Considering the fact that no bits need to be spent on the fractionalparts of motion vectors for such content, this means the bit rateincurred in encoding such content can be reduced.

For example, while encoders normally interpret motion vectors inbitstreams in units of ¼ pixel offsets, an encoder may in fact often beable to save bit rate by abandoning this resolution and instead encodingthe motion vectors for screen coding applications in units of integerpixel offsets. Although it will reduce the precision of the motionvectors by a factor of four, such precision is generally less worthwhilefor screen sharing or recording applications and this also reduces thenumber of bits needed to code the vectors. To predict a current (target)block from a reference block 1 pixel left of the target block, themotion vector will be (1,0) instead of (4,0). Using the above Golombencoding, this means the bits incurred for encoding the motion vectorchange from (00111, 1) to (010, 1) and so two bits are saved in thiscase.

Furthermore, in embodiments the reduced resolution motion vector mayalso reduce the complexity of the motion estimation performed at theencoder by restricting the motion vector search to integer values, thusreducing processing resources incurred by the search. Alternatively itwould be possible to perform a normal search and round the resultingmotion vectors to integer values.

FIG. 7 shows an example of motion prediction constrained to a resolutionof whole pixels only, with the motion vector being constrained to wholepixel steps only. In contrast with FIG. 6, the pixel p is predicted onlyfrom a single, whole pixel a with no interpolation. It couldalternatively have been predicted from pixel b, c, d or another pixeldepending on the offset between the target block in one frame and thereference portion in the other frame (shown again with bold dottedlines), but due to the constraint it could not have been predicted froman interpolation between pixels. Note: for any given block the quarterpixel prediction as illustrated by way of example in FIG. 6 could happento have generated a whole pixel offset with no interpolation, if thatgave the lowest residual. However, it would not have been constrained todoing so, and over a sizable image it would be highly unlikely thatwould have happened for all blocks.

Considering that fractional motion vector values can still be veryuseful for camera-captured content, in embodiments the encoder 40 isprovided with a controller 50 coupled to the motion prediction module 43with the controller 50 being configured to select the motion vectorresolution in a flexible way: when the source data is from a capturedscreen 17 and there is no fractional pixel motion, the motion vector isencoded and transmitted in units of only whole pixels; but forcamera-content video the motion vectors are still encoded andtransmitted with fractional pixel precision.

In order to do this, the controller 50 may be configured to measure aperformance heuristic indicative of the fact that the type of contentbeing captured is screen content. In response, it then disablesfractional pixel motion compensation for screen content coding.Alternatively, the controller 50 may receive an indication from anapplication or the operating system as to what type of data it issupplying to the encoder for encoding, and the controller 50 may selectbetween the mode on that basis. As another option is may make theselection based on historical data. The selection may be made on aper-frame basis, or the mode may be selected individually for differentregions within a frame, e.g. on a per slice basis.

Thus before encoding a frame or slice, the encoder is able to decide themotion vector resolution based on factors such as historical statisticaldata, knowledge of its type of application, multi-pass analysis, or someother such technique. If the encoder decides to use full pixel motionestimation only, the fractional pixel search is skipped. If a scaledmotion vector prediction has a fractional part, the prediction may berounded to an integer value.

In further embodiments, the control may optionally be applied separatelyto the vertical or horizontal component of a vector. This may be usefulfor encoding screen video that is scaled horizontally or vertically.E.g. consider a case where the encoder is working with a screen shareresized horizontally or vertically. In this case, one of the componentsof the motion vectors will have fractional parts while the othercomponent will not. To control the bit rate, the encoder may adjust thequantization parameter (QP) in a predefined range. If the QP has reachedto the allowed upper bound, and the bit rate is still too high, theencoder may trigger an internal resizer. It resizes the incomingpictures horizontally and at the decoder side the decoded pictures arestretched back to original width. Hence a situation may arise where itwould also be useful to treat the horizontal and vertical motion vectorsdifferently.

In order to represent the motion vector on a reduced resolution scale inunits or steps of integer pixels, and thus achieve the associatedbitrate savings over conventional codecs, the protocol for signaling themotion vectors will have to be updated for future codec standards. Inembodiments this may be implemented as an update to the H.265 (HEVC,High Efficiency Video Coding) standard. For encoding captured screencontent, the format of the encoded data 34 will be given a reduced sizemotion vector field for each motion vector. For an encoded screencapture stream encoded in the integer pixel mode, the relevant data 34will thus comprise integer motion vectors in the bitstream 33 and inembodiments only integer motion vectors in the bitstream 33.

In embodiments this will be optional, with a flag 37 also included inthe header 36 to indicate whether fractional pixel (e.g. ¼ pixel) orinteger pixel resolution is being used in the encoding of the associatedframe or slice (refer again to FIG. 3). If the horizontal and verticalresolutions can be selected separately, two flags 37 will be requiredper frame or slice.

The following discloses an exemplary embodiment based on an update tothe H.265 standard. The modification enables motion vectors to berepresented on a reduced, integer pixel scale in the encoded bitstream33, and adds two flags 37 per slice in the header information 36 of thecompressed stream in order to signal the resolution of motion vectors intheir horizontal and vertical components.

The modification does not change the syntax or parsing process otherthan at the header level, but modifies the decoding process byinterpreting the motion vector differences as integers and roundingscaled MV predictors to integer values. The modification has been foundto increase coding efficiency as much as 7% and on average by about 2%for tested screen content sequences, and it can also reduce thecomplexity of the encoding and decoding processes.

A high-level indicator is added (at the SPS, PPS, and/or slice headerlevel) to indicate the resolution for interpretation of the motionvectors.

In the decoding process, if the motion vectors are indicated to be atfull pixel resolution and a scaled motion vector prediction has afractional part, then in embodiments the prediction is rounded to aninteger value. Motion vector differences are simply interpreted asinteger offsets rather than ¼-sample offsets. All other decodingprocesses remain the same. The parsing process (below the header level)is also unchanged. When the motion vectors are coded at full-sampleprecision and the input image data uses 4:2:2 or 4:2:0 sampling, thechroma motion vectors can be derived in the usual manner, which willproduce ½-sample chroma motion displacements. Alternatively, the chromamotion vectors may also be rounded to integer values.

Regarding the syntax change for signaling the motion vector resolution,in embodiments there are three possible modes, with a mode indicatorbeing signaled at a higher (per frame) header level such as the pictureparameter set (PPS), or alternatively at an even higher level such asthe sequence parameter set (SPS). The mode indicator has threeselectable values. One value indicates that motion vectors are alwaysinterpreted as representing 14 sample offsets (in pictures that use thisPPS). A second value indicates that motion vectors are alwaysinterpreted as representing integer offsets (in pictures that use thisPPS). A third value indicates that there is a signal at a lower levelthat adaptively selects the interpretation to be applied at that lowerlevel. This lower-level indication may be a flag in the slice headerthat will be present only when operating in this third mode.

To implement this, in embodiments a new two-bit indicator will beincluded in the PPS extension to indicate the motion vector resolutioncontrol modes. This indicator may be referred to asmotion_vector_resolution_control_idc. When the mode is 0, the motionvectors are encoded at ¼ pixel precision and all decoding processesremain unchanged. When the mode is 1, all of the motion vectors in theslices that refer to the PPS are encoded at full pixel precision. Andwhen the mode is 2, the motion vector resolution is controlled on aslice-by-slice basis by a flag in the slice header. Whenmotion_vector_resolution_control_idc is not present, its value isinferred as 0. When motion_vector_resolution_control_idc is equal to 2,an additional flag called slice_motion_vector_resolution_flag issignalled in the slice header. When the flag is zero, the motion vectorsof this slice are encoded at ¼ pixel precision, and when the flag is 1,the motion vectors are encoded at full pixel precision. When the flag isnot present, its value is inferred as equal to the value ofmotion_vector_resolution_control_idc.

The modified PPS syntax is illustrated as follows:

pic_parameter_set_rbsp( ) { Descriptor  pps_pic_parameter_set_id ue(v) pps_seq_parameter_set_id ue(v)  dependent_slice_segments_enabled_flagu(1)  output_flag_present_flag u(1)  num_extra_slice_header_bits u(3) sign_data_hiding_enabled_flag u(1)  cabac_init_present_flag u(1) ... lists_modification_present_flag u(1)  log2_parallel_merge_level_minus2ue(v)  slice_segment_header_extension_present_flag u(1) pps_extension1_flag u(1)  if( pps_extension1_flag ) {   if(transform_skip_enabled_flag )   log2_max_transform_skip_block_size_minus2 ue(v)  luma_chroma_prediction_enabled_flag u(1)  motion_vector_resolution_control_idc u(2)  chroma_qp_adjustment_enabled_flag u(1)   if(chroma_qp_adjustment_enabled_flag ) {   diff_cu_chroma_qp_adjustment_depth ue(v)   chroma_qp_adjustment_table_size_minus1 ue(v)    for( i = 0; i <=   chroma_qp_adjustment_table_size_minus1;    i++ ) {    cb_qp_adjustment[ i ] se(v)     cr_qp_adjustment[ i ] se(v)    }   }  pps_extension2_flag u(1)  }  if( pps_extension2_flag )   while(more_rbsp_data( ) )    pps_extension_data_flag u(1)  rbsp_trailing_bits() }

The modified slice header syntax is illustrated as follows:

slice_segment_header( ) { Descriptor  first_slice_segment_in_pic_flagu(1)  if( nal_unit_type >= BLA_W_LP && nal_unit_type <= RSV_IRAP_VCL23 )  no_output_of_prior_pics_flag u(1)  slice_pic_parameter_set_id ue(v) ...   if( slice_type == P || slice_type == B ) {    if(motion_vector_resolution_control_idc == 2)    slice_motion_vector_resolution_flag u(1)   num_ref_idx_active_override_flag u(1)    if(num_ref_idx_active_override_flag ) {     ...

Regarding the scaling mentioned above, this is something that can occurfor example in HEVC (H.265). The idea is that if a motion vector is usedfor coding some other frame, it can be computed what would be the motionvector that would be equivalent in terms of the relative positioningdisplacement between: (i) the current picture and (ii) its referencepicture. This is based on the relative positioning of the displacementindicated by a motion vector in the co-located part of another picture,and based on the relative positioning displacement between (iii) thatpicture and (iv) the picture it was referencing as its referencepicture. That is, the motion vectors themselves can be encoded based onprediction, with the motion vector for the target block in the current,target frame being encoded relative to a previous motion vector for aspatially corresponding block in a previous frame. The motion vector forthe target block is then signaled in the encoded bitstream 33 only interms of a difference (e.g. typically a delta) between the predictedversion and the actual version. The decoder can then recreate theencoded motion vector by performing the same prediction at the decoderside and adding the delta.

However, the temporal frame rate of the coded data is not alwaysconstant, and also there may be a difference between the order in whichpictures are coded in the bitstream and the order in which they arecaptured and displayed. These temporal relationships may be computed andthen used to scale the motion vector so that it basically represents thesame speed of motion in the same direction. I.e. the predicted versionof the motion vector is not just equal to the reference vector, butrather is a scaled version of it. This is known as temporal motionvector prediction.

The current motion vector (MV) decoding process in the HEVC standard maybe summarized as follows.

-   1. Determine how the MV is to be predicted at the decoder and    whether or not a motion vector delta (MVD) has been sent in the    encoded bitstream from the encoder (this may involve some syntax    indications).-   2. Generate the predicted motion vector (PMV). This creates a pair    of integers (px, py). The integers are assumed to represent offsets    with quarter sample position precision in the luma domain.-   3. If no MVD is sent, set the MV value (mx, my) to (px, py);    otherwise decode the pair of integers (px, py) as (dx, dy), and set    the MV (mx, my) to (px+dx, py+dy). The MV is interpreted as    representing ¼-sample offsets in the luma domain. Note: the luma    distinction only matters if the video is in a format such as 4:2:2    or 4:2:0 which use different resolution in the luma channel than in    the chroma channels; if instead the video is 4:4:4 format for    example, the offset is interpreted as having ¼ sample units for all    sampling grids.-   4. Store the final value (mx, my) for subsequent use for generating    subsequent PMVs (and controlling deblocking filtering, etc.).

In embodiments of the present disclosure, when the integer pixel motionvector mode is being used, the scaled motion vector may be rounded inthe decoding process to accommodate the restriction to integer pixelresolution. For example motion vector decoding process may be modifiedas follows.

-   1. Determine how the MV is to be predicted at the decoder and    whether or not a motion vector delta (MVD) has been sent in the    encoded bitstream from the encoder (this may involve some syntax    indications).-   2. Generate the predicted motion vector (PMV). This creates a pair    of integers (px, py). The integers are assumed to represent offsets    with quarter sample position precision in the luma domain.-   3. If operating in integer-precision mode, do this:    -   a. Round off the prediction value to make it correspond to an        integer offset—e.g. create (rx, ry)=(round(px/4), round(py/4)).    -   b. If no MVD is sent, set the MV value (mx, my) to (4*rx, 4*ry);        otherwise decode the pair of integers (px, py) as (dx, dy), and        set the MV (mx, my) to (4*(rx+dx), 4*(ry+dy)). The MV is then        interpreted as representing ¼-sample offsets in the luma domain        (N.B. again the luma distinction only matters if the video is in        a format such as 4:2:2 or 4:2:0).-   4. Otherwise (i.e. when operating in ¼-sample precision mode), do    this: If no MVD is sent, set the MV value (mx, my) to (px, py);    otherwise decode the pair of integers (px, py) as (dx, dy), and the    MV (mx, my) is set to (px+dx, py+dy). The MV is again interpreted as    representing ¼-sample offsets in the luma domain.-   5. Store the final value (mx, my) for subsequent use for generating    subsequent PMVs (and controlling deblocking filtering, etc.).

However, the above process is not necessary for all possibleembodiments. The approach outlined above assumes that the decoderoperates in the ¼ pixel domain from the beginning such that the scalingin the motion vector prediction occurs in the ¼ pixel domain. However,in fact the decoder does not necessarily have to know what the unitsmean at this stage. Thus is it possible to take an alternative approachwhereby no interpretation is placed on the units until later when usedto actually generate the image.

The following describes a decoding process according to embodiments ofsuch an alternative approach. As above, at least one of the motionvector values is differentially encoded, with the motion predictionmodule 73 being configured to predict the motion vector value by scalinganother of said motion vector values. At least one of the motion vectorvalues may be differentially encoded in terms of a delta value, and themotion prediction module 73 may be configured to predict the motionvector value by scaling another of said motion vector values to producea scaled motion vector value, and then adding the delta value to thescaled motion vector value. However, unlike the above, the motionprediction module 73 is further configured to interpret the motionvector value in said integer pixel units (when the integer mode is beingused) without rounding it to integer pixel resolution after the scaling.This is made possible by refraining from placing an interpretation onthe units in the scaling. The motion prediction module 73 may beconfigured to interpret the motion vector value in said integer pixelunits by performing the addition of the delta value to the scaled motionvector value without rounding the scaled motion vector value to integerpixel resolution. The resulting motion vector value is only interpretedin terms of integer or fractional pixel units when used to generate theimage. The resulting value is also stored for use in predicting one ormore subsequent motion vectors without placing an interpretation on thestored value in terms of either integer or fractional units.

For example according to such an alternative, the motion vector decodingprocess may be implemented as follows.

-   1. Determine how the MV will be predicted at the decoder and whether    or not a motion vector delta (MVD) has been sent in the encoded    bitstream from the encoder (this may involve some syntax    indications).-   2. Generate the predicted motion vector (PMV). This creates a pair    of integers (px, py). However, don't worry about what this might    represent—i.e. do not place any interpretation on the units at this    stage.-   3. If no MVD is sent, set the MV value (mx, my) to (px, py);    otherwise decode the pair of integers (px, py) as (dx, dy), and set    the MV (mx, my) to (px+dx, py+dy). If operating in integer-precision    mode, interpret the MV as representing whole-integer offsets in the    luma domain, i.e. as representing the value (4*mx, 4*my) in ¼-sample    offset units. Otherwise (i.e. when operating in ¼-sample precision    mode), interpret the MV as representing ¼-sample offsets in the luma    domain, i.e. as representing the value (mx, my) in ¼-sample offset    units (N.B. again the luma distinction only matters if the video is    in a format such as 4:2:2 or 4:2:0).-   4. Store the final value (mx, my) for subsequent use for generating    subsequent PMVs (and controlling deblocking filtering, etc.). Again,    don't worry about what this might represent.

Thus that the rounding step 3 a described earlier is now eliminated.Only the interpretation of the numbers is modified. This makes thedecoding process less complex, because no modification of the MVprediction process is necessary.

Note that the rounding discussed above refers to the rounding from ¼ (orfractional) resolution to integer resolution. In present standards thereis also a rounding from an even finer precision to the ¼ resolution aspart of the motion vector prediction—and in the alternative embodimentabove it is not excluded that such a preliminary rounding is stillpresent.

There may be some side effects of operating in this manner. One sideeffect may be that if some pictures use a different mode than others,the scaling used in the MV prediction process for temporal MV predictionwon't be correct. However, this would be a very minor effect—especiallysince it would be rare to have this situation of operating in differentmodes, and also because temporal MV prediction ordinarily only has avery minor benefit. Another side effect may be that the results of thedeblocking filter control may depend on MV values that are interpretedat a different scale factor. However this effect would also be minor,especially since deblocking might be disabled or may not have much of aneffect when coding screen content.

Another possibility would be to disable temporal motion vectorprediction whenever using integer motion only. There is already syntaxin HEVC that lets the encoder disable the use of that feature. Thatwould be a possible way to avoid needing the decoder to have a specialprocess that operates differently depending on whether the differencesare coded as integers or as fractional values. The gain obtained fromtemporal motion vector prediction may be small (or zero) in these usagecases anyway, so disabling it need not be undesirable.

It will be appreciated that the above embodiments have been describedonly by way of example.

For instance, while the above has been described in terms of blocks,this does not necessarily limit to the divisions called blocks in anyparticular standard. For example the blocks referred to herein may bethe divisions called blocks or macroblocks in the H.26x standards.

The scope of the disclosure limited to any particular codec or standardand in general the techniques disclosed herein can be implemented eitherin the context of an existing standard or an update to an existingstandard, whether an H.26x standard like H264 or H.265 or any anotherstandard, or may be implemented in a bespoke codec. Further, the scopeof the disclosure is not restricted specifically to any particularrepresentation of video samples whether in terms of RGB, YUV orotherwise. Nor is the scope limited to any particular quantization, norto a DCT transform. E.g. an alternative transform such as aKarhunen-LoeveTransform (KLT) could be used, or no transform may beused. Further, the disclosure is not limited to VoIP communications orcommunications over any particular kind of network, but could be used inany network or medium capable of communicating data.

Where it is said that the motion vector offset is restricted or notrestricted to an integer number of pixels, or the like, this may referto the motion estimation in any one or two of the colour space channels,or the motion estimation in all three colour channels.

Further, the invention is not limited to selecting between integer pixeland quarter pixel resolution. In general the techniques described hereincan be applied to selecting between integer pixel resolution and anyfractional pixel resolution, e.g. ½ pixel resolution; or selectingbetween integer pixel resolution and a plurality of different fractionalpixel modes, e.g. selecting between integer, ½ and ¼ pixel modes.

Further, the scope of the disclosure is not limited to an application inwhich the encoded video and/or screen capture stream is transmitted overa network, nor in which the streams are live stream. For example inanother application, the stream may be stored on a storage device suchas an optical disk, hard drive or other magnetic storage, or “flash”memory stick or other electronic memory. Note therefore that a screensharing stream does not necessarily have to mean live sharing (thoughthat is certainly one option). Alternatively or additionally it could bestored for sharing with one or more other users later, or the capturedimage data may not be shared but rather just recorded for the user whowas using the screen at the time. Generally the screen capture could beany moving image data consisting of captured encoder-side screencontent, captured by any suitable means (not necessarily by reading fromthe screen buffer, though that is one option), to be shared with one ormore other users (live or not) or simply recorded for the benefit of thecapturing user or for just for archive (perhaps never to actually beviewed again as it may turn out).

Note also that the codec is not necessarily limited to encoding onlyscreen capture data and video. In embodiments it may also be capable ofencoding other types of moving image data, e.g. an animation. Such othertypes of moving image data may be encoded in the fractional pixel modeor integer pixel mode.

Further, note that inter frame encoding does not necessarily always haveto encode relative to a previous frame, but more generally some codecsmay allow encoding relative to a different frame other than the targetframe, either preceding or ahead of the target frame (assuming asuitable outgoing buffer).

Further, as discussed previously, note that motion vectors themselvesmay be encoded differentially. In this case where it is said that themotion vector as signaled in the encoded bitstream is restricted to aninteger number of pixels, or the like, this means a differentiallyencoded form of the motion vector is so restricted (e.g. the delta).

Further, the decoder does not necessarily have to be implemented at anend user terminal, nor output the moving image data for immediateconsumption at the receiving terminal. In alternative implementations,the receiving terminal may be an intermediate terminal such as a serverrunning the decoder software, for outputting moving image data toanother terminal in decoded or transcoded form, or storing the decodeddata for later consumption. Similarly the encoder does not have to beimplemented at an end-user terminal, nor encode moving image dataoriginating from the transmitting terminal. In other embodiments thetransmitting terminal may for example be an intermediate terminal suchas a server running the encoder software, for receiving moving imagedata in unencoded or alternatively-coded form from another terminal andencoding or transcoding that data for storage at the server orforwarding to a receiving terminal.

Generally, any of the functions described herein can be implementedusing software, firmware, hardware (e.g., fixed logic circuitry), or acombination of these implementations. The terms “module,”“functionality,” “component” and “logic” as used herein generallyrepresent software, firmware, hardware, or a combination thereof. In thecase of a software implementation, the module, functionality, or logicrepresents program code that performs specified tasks when executed on aprocessor (e.g. CPU or CPUs). The program code can be stored in one ormore computer readable memory devices. The features of the techniquesdescribed below are platform-independent, meaning that the techniquesmay be implemented on a variety of commercial computing platforms havinga variety of processors.

For example, the terminals may include an entity (e.g. software) thatcauses hardware of the user terminals to perform operations, e.g.,processors functional blocks, and so on. For example, the terminals mayinclude a computer-readable medium that may be configured to maintaininstructions that cause the user terminals, and more particularly theoperating system and associated hardware of the user terminals toperform operations. Thus, the instructions function to configure theoperating system and associated hardware to perform the operations andin this way result in transformation of the operating system andassociated hardware to perform functions. The instructions may beprovided by the computer-readable medium to the terminals through avariety of different configurations.

One such configuration of a computer-readable medium is signal bearingmedium and thus is configured to transmit the instructions (e.g. as acarrier wave) to the computing device, such as via a network. Thecomputer-readable medium may also be configured as a computer-readablestorage medium and thus is not a signal bearing medium. Examples of acomputer-readable storage medium include a random-access memory (RAM),read-only memory (ROM), an optical disc, flash memory, hard disk memory,and other memory devices that may us magnetic, optical, and othertechniques to store instructions and other data.

Although the subject matter has been described in language specific tostructural features and/or methodological acts, it is to be understoodthat the subject matter defined in the appended claims is notnecessarily limited to the specific features or acts described above.Rather, the specific features and acts described above are disclosed asexample forms of implementing the claims.

1. A decoder comprising: an input for receiving moving image data in anencoded bitstream, including a plurality of frames in which at least aregion is encoded using motion estimation, the moving image dataincluding a respective set of motion vector values associated with eachrespective one of the frames or with each respective region within eachof said frames, the moving image data further including a mode indicatorin a high level header associated with each of the respective frames orregions indicating whether the respective set of motion vector valuesare interpreted at a first resolution or at a second resolution; amotion prediction module for decoding said frames or regions based onthe motion vector values, the decoding comprising: determining, from themode indicator, whether the respective set of motion vector values ofthe respective frame or region are encoded at the first resolution or atthe second resolution, or whether the set of motion vector values of therespective frame or region are interpreted at a lower level based on aflag that adaptively indicates interpretation of the respective set ofmotion vector values to be applied at the lower level; and interpretingthe motion vector values in units of fractional pixels for the firstresolution or in units of integer pixels for the second resolution basedon the mode indicator.